Complexity results for scheduling chains on a single machine
نویسندگان
چکیده
منابع مشابه
Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars
Airborne radars are widely used to perform a large variety of tasks in an aircraft (searching, tracking, identifying targets, etc.) Such tasks play a crucial role for the aircraft and they are repeated in a “more or less” cyclic fashion. This defines a scheduling problem that impacts a lot on the quality of the radar output and on the overall safety of the aircraft. In our model, jointly define...
متن کاملSingle machine scheduling problems with financial resource constraints: Some complexity results and properties
We consider single machine scheduling problems with a non-renewable resource. This type of problems has not been intensively investigated in the literature so far. For several problems of this type with standard objective functions (namely the minimization of makespan, total tardiness, number of tardy jobs, total completion time and maximum lateness), we present some complexity results. Particu...
متن کاملApproximation results for a bicriteria job scheduling problem on a single machine without preemption
We study the problem of minimizing the average weighted completion time on a single machine under the additional constraint that the sum of completion times does not exceed a given bound B (1 !Cj B !wjCj) for which we propose a 2 1 -approximationalgorithm. We also address the problem1 !c jCj B !wjCj for which we present a 2 2 -approximation algorithm. After showing that the problem of minimizin...
متن کاملIntegrated Due Date Setting and Scheduling on a Single Machine Considering an Unexpected Unavailability
In this paper, an integrated machine scheduling withits due date setting problem has been considered. It is assumed that the machine is subject to some kind of random unavailability. Due dates should be set in an attractive and reliable manner, implying that they should be short and possible to be met. To this end, first, long due dates are penalized in the objective function. Then, for each cu...
متن کاملMultiprocessor scheduling with machine eligibility: Time complexity results
Polynomially solvable NP-hard pseudopolynomially solvable Strongly NP-hard P M j , p j = 1 Cmax R M j , pmtn ∗ Cmax P2 |M j | = 2 Cmax Pm |M j | = 2 Cmax Rm M j Cmax P |M j | = 2 Cmax
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1980
ISSN: 0377-2217
DOI: 10.1016/0377-2217(80)90111-3